#define _CRT_SECURE_NO_WARNINGS

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<int> dp(prices.size(), 0);
        for (int i = 1; i < prices.size(); i++)
        {
            if (prices[i] > prices[i - 1])
                dp[i] = dp[i - 1] + (prices[i] - prices[i - 1]);
            else
                dp[i] = dp[i - 1];
        }
        return dp[prices.size() - 1];
    }
};

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() == 1)
            return 0;
        vector<vector<int>> dp(prices.size(), { 0,0 });
        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        for (int i = 1; i < prices.size(); i++)
        {
            dp[i][0] = max(dp[i - 1][0], -prices[i]);
            dp[i][1] = max(dp[i - 1][0] + prices[i], dp[i - 1][1]);
        }
        return dp[prices.size() - 1][1];
    }
};

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<int> dp(prices.size(), 0);
        for (int i = 1; i < prices.size(); i++)
        {
            if (prices[i] > prices[i - 1])
                dp[i] = dp[i - 1] + (prices[i] - prices[i - 1]);
            else
                dp[i] = dp[i - 1];
        }
        return dp[prices.size() - 1];
    }
};

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() == 1)
            return 0;
        vector<vector<int>> dp(prices.size(), { 0,0 });
        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        for (int i = 1; i < prices.size(); i++)
        {
            dp[i][0] = max(dp[i - 1][1] - prices[i], dp[i - 1][0]);
            dp[i][1] = max(dp[i - 1][0] + prices[i], dp[i - 1][1]);
        }
        return dp[prices.size() - 1][1];
    }
};